Stereo Matching With Color-Weighted Correlation, Hierarchical Belief Propagation And Occlusion Handling
نویسنده
چکیده
In this paper, we contrive a stereo matching algorithm with careful handling of disparity, discontinuity and occlusion. This algorithm works a worldwide matching stereo model which is based on minimization of energy. The global energy comprises two terms, firstly the data term and secondly the smoothness term. The data term is approximated by a color-weighted correlation, then refined in obstruct and low-texture areas in many applications of hierarchical loopy belief propagation algorithm. The results during the experiment are evaluated on the Middlebury data sets, showing that out algorithm is the top performer among all the algorithms listed there
منابع مشابه
Refinement using O Scene Reconstruction
An occurrence of occlusion is the challenge problem in stereo matching. In this paper, we propose a refinement algorithm of disparity maps with occlusion handling. In order to refine the disparity map, we obtain an initial disparity map with an optimization algorithm based on the modified constant-space belief propagation low complexity. An occlusion map is computed using unique constraint from...
متن کاملRevisiting Intrinsic Curves for Efficient Dense Stereo Matching
Dense stereo matching is one of the fundamental and active areas of photogrammetry. The increasing image resolution of digital cameras as well as the growing interest in unconventional imaging, e.g. unmanned aerial imagery, has exposed stereo image pairs to serious occlusion, noise and matching ambiguity. This has also resulted in an increase in the range of disparity values that should be cons...
متن کاملHierarchical Scan-Line Dynamic Programming for Optical Flow Using Semi-Global Matching
Dense and robust optical flow estimation is still a major challenge in low-level computer vision. In recent years, mainly variational methods contributed to the progress in this field. One reason for their success is their suitability to be embedded into hierarchical schemes, which makes them capable of handling large pixel displacements. Matching-based regularization techniques, like dynamic p...
متن کاملOcclusion Detection Using Warping and Cross- Checking Constraints for Stereo Matching
In this paper, we propose an occlusion detection algorithm which estimates occluded pixels automatically. In order to detect the occlusion, we obtain an initial disparity map with an optimization algorithm based on the modified constant-space belief propagation (CSBP) which has low complexity. The initial disparity map gives us clues for occlusion detection. These clues are the warping constrai...
متن کاملAn asymmetric post-processing for correspondence problem
This paper presents a novel approach that performs post-processing for stereo matching. We improve the performance of stereo matching by performing consistency check and adaptive filtering in an iterative filtering scheme. The consistency check is only done with asymmetric information so that very few additional computational loads are necessary. The information in the valid pixels is propagate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017